Rank-non-increasing transformations on transition graphs
نویسندگان
چکیده
منابع مشابه
Transformations on Dependency Graphs :
Dependency graphs are used to model data and control ow in hardware and software design. In a transformational design approach, optimization and re nement transformations are used to transform dependency-graph-based speci cations at higher abstraction levels to those at lower abstraction levels. In this dissertation, we investigate the formal speci cation and mechanical veri cation of transform...
متن کاملTransformations on Graphs and Convexity
A bstract . Graph transformations tha.t ma.y be reduced to the form x(l +l) = x(I)+vu(Ax(I)), with x(I),x(I+1 ) E R , u convex function and A symmet ric mat rix, are studied. In par t icular , a reduction to t he class is exhibited for some graph t ransformations recentl y introduced by Odlyzko and Randall. Fur ther result s on periods, quasi-periods, and pre-periods are presented. A class of m...
متن کاملOn the Rank of Graphs
The properties of singular graphs obtained in a previous paper "On the construction of graphs of nullity one", lead to the characterization of graphs of small rank. The minimal configurations that are contained in singular graphs were identified as "grown" from certain cores. A core of a singular graph G is a subgraph induced by the vertices corresponding to the non-zero components of an eigenv...
متن کاملOn Rank Functions of Graphs
We study rank functions (also known as graph homomorphisms onto Z), ways of imposing graded poset structures on graphs. We first look at a variation on rank functions called discrete Lipschitz functions. We relate the number of Lipschitz functions of a graph G to the number of rank functions of both G and G× E . We then find generating functions that enable us to compute the number of rank or L...
متن کاملSome Remarks on Zero-Increasing Transformations
Let T be a linear operator which maps polynomials of degree n to polynomials of degree n, for every n. We discuss the problem of trying to characterize the set of all such operators which satisfy ZI(p) ≤ ZJ (Tp) for every real-valued polynomial p, where ZI counts the number of zeros on the interval I of IR. §
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1972
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(72)90288-4